Path-sequential labellings of cycles
نویسندگان
چکیده
منابع مشابه
Analysis of Combinational Cycles in Sequential Circuits
This paper addresses the analysis of combinational cycles in synchronous, sequential circuits. A circuit that has a com-binational cycle does not necessarily have unstable output behavior: the cycle may be \false" for all reachable states and possible input sequences, or the unstable behavior on the cycle may not aaect the outputs. We provide a procedure to determine whether a circuit produces ...
متن کاملConnections between labellings of trees
There are many long-standing conjectures related with some labellings of trees. It is important to connect labellings that are related with conjectures. We find some connections between known labellings of simple graphs.
متن کاملImplementation of Greedy Sequential Unique Path
Digital Forensic Analyst encounters a mixed file fragments in the absence of File Table information i.e., files‟ metadata. File Carving is a process of reconstructing files from mixed file fragments without using files‟ metadata. File Carving is an interesting and challenging problem in digital forensics and Data Recovery. Recently there have been number of research papers in the area of File C...
متن کاملRelaxed Graceful Labellings of Trees
A graph G on m edges is considered graceful if there is a labelling f of the vertices of G with distinct integers in the set {0, 1, . . . ,m} such that the induced edge labelling g defined by g(uv) = |f(u) − f(v)| is a bijection to {1, . . . ,m}. We here consider some relaxations of these conditions as applied to tree labellings: 1. Edge-relaxed graceful labellings, in which repeated edge label...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1996
ISSN: 0012-365X
DOI: 10.1016/0012-365x(95)00289-9